Real Time Study of a k-out-of-n System: n Identical Elements with Increasing Failure Rates
Authors
Abstract:
This article doesn't have abstract
similar resources
On Conditional Inactivity Time of Failed Components in an (n-k+1)-out-of-n System with Nonidentical Independent Components
In this paper, we study an (n-k+1)-out-of-n system by adopting their components to be statistically independent though nonidentically distributed. By assuming that at least m components at a fixed time have failed while the system is still working, we obtain the mixture representation of survival function for a quantity called the conditional inactivity time of failed components in the system. ...
full textAvailability Optimization of a Series Repairable System with Multiple k-out-of-n Subsystems
An availability model is developed to optimize the availability of a series repairable system with multiple k-out-of-n subsystems in this paper. There are two types of decision variables that determine the system designer’s decision to allocate the number of repairmen and to allocate the number of redundant components in each subsystem in the presence of weight, volume and cost constraint...
full textAvailability of k-out-of-n: F Secondary Subsystem with General Repair Time Distribution
In this paper we study the steady state availability of main k-out-of-n: F and secondary subsystems having general repair time distribution. When more than k units of main subsystem fail, then the main subsystem shuts off the secondary subsystem. The life time distributions of the main units and that of secondary subsystem are exponentially distributed. A repair facility having single repairman...
full textNumber of Minimal Path Sets in a Consecutive-k-out-of-n: F System
In this paper the combinatorial problem of determining the number of minimal path sets of a consecutive-k-out-of-n: F system is considered. For the cases where k = 2, 3 the explicit formulae are given and for k ≥ 4 a recursive relation is obtained. Direct computation for determining the number of minimal path sets of a consecutive-k-out-of-n: F system for k ≥ 4 remains a difficult task. ...
full textMy Resources
Journal title
volume 1 issue None
pages 56- 67
publication date 2009-06
By following a journal you will be notified via email when a new issue of this journal is published.
Hosted on Doprax cloud platform doprax.com
copyright © 2015-2023